Hierarchical Learning Water Cycle Algorithm

In order to improve the global searching ability of Water Cycle Algorithm (WCA), the hierarchical learning concept is introduced and the Hierarchical Learning WCA (HLWCA) is proposed in this paper. The underlying idea of HLWCA is to divide the solutions into collections and give these collections with hierarchy differences. One of the collections has a higher hierarchy than others and utilizes an exploration-inclined updating mechanism. The solutions in this high hierarchy collection are the exemplars of other collections. The other collections are sorted according to the exemplars’ function value and the solutions in these collections actively choose whether to follow their own exemplar or not. Through different updating mechanisms of collections, the global searching ability is improved while the fast convergence and strong local search ability of WCA are retained. The proposed HLWCA is firstly experimented on IEEE CEC 2017 benchmark suite to testify its performance on complex numerical optimization tasks. Then, it is tested on four practical design benchmark problems to verify its ability of solving real-world problems. The experimental results illustrate the efficiency of the proposed algorithm.     

Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

The minimum cost flow problem (MCFP) is the most generic variation of the network flow problem which aims to transfer a commodity throughout the network to satisfy demands. The problem size (in terms of the number of nodes and arcs) and the shape of the cost function are the most critical factors when considering MCFPs. Existing mathematical programming techniques often assume the cost functions to be linear or convex. Unfortunately, the linearity and convexity assumptions are too restrictive for modelling many real-world scenarios. In addition, many real-world MCFPs are large-scale, with networks having a large number of nodes and arcs. In this paper, we propose a probabilistic tree-based genetic algorithm (PTbGA) for solving large-scale minimum cost integer flow problems with nonlinear non-convex cost functions. We first compare this probabilistic tree-based representation scheme with the priority-based representation scheme, which is the most commonly-used representation for solving MCFPs. We then compare the performance of PTbGA with that of the priority-based genetic algorithm (PrGA), and two state-of-the-art mathematical solvers on a set of MCFP instances. Our experimental results demonstrate the superiority and efficiency of PTbGA in dealing with large-sized MCFPs, as compared to the PrGA method and the mathematical solvers.     

基于改进人工蜂群算法的多目标绿色柔性作业车间调度研究

针对多目标绿色柔性作业车间调度问题（MGFJSP）的特点，提出从碳排放量、噪声和废弃物这3个指标来综合评定环境污染程度，建立了以最小化最大完成时间和环境污染程度为优化目标的MGFJSP模型，并提出了一种改进的人工蜂群算法来求解该模型。算法的具体改进包括：设计了一种三维向量的编码和对应解码方案，在跟随蜂搜索阶段引入一种有效的动态邻域搜索操作来提高算法的局部搜索能力，在侦查蜂阶段提出产生新食物源的策略用于增加种群的多样性。最后进行了实验研究与算法对比，以验证所建模型和所提算法的有效性。     

A Methodology for Modeling and Optimizing Social Systems

Abstract

A system methodology for modeling and optimizing social systems is presented. It allows constructing dynamical models formulated stochastically, i.e., their results are given by confidence intervals. The models provide optimal intervention ways to reach the stated objectives. Two optimization methods are used: (1) to test strategies and scenarios and (2) to optimize with a genetic algorithm. The application case presented is a small nonformal education Spanish business. First, the model is validated in the 2008–2012 period, and subsequently, the optimal way to obtain a maximum profit in the 2013–2025 period is obtained using the two methods.     

MW级空间核反应堆系统热管式辐射散热器分析及优化

空间核反应堆是空间核电源和核推进的研究基础，大功率核反应堆的体积和质量一直是限制航空航天设计的重要因素。针对这一问题，本文对MW级空间核反应堆系统热管式辐射散热器进行建模和分析，建立热管式辐射散热器的热阻模型，利用穷举法和遗传算法在给定工况下探讨裸碳纤维翅片长度L_f和厚度δ_f、冷却剂质量流量m、辐射散热器入口温度T_f1对散热器质量M的影响。结果表明，当T_f1＝800 K、L_f＝5 cm、δ_f＝0.16 mm、m＝9 kg/s时，M达到最优，为906.593 kg，优化了0.63%的系统质量。     

SCMA场景下的极化码编解码方案改进研究

极化码是目前唯一一种被证明可达到信道容量的编码方式,稀疏码分多址接入(Sparse Code Division Multiple Access,SCMA)可以提高频谱资源的利用率和接入系统的用户接入数量。为了提升SCMA与极化码的联合系统的误码率性能和译码时延,使联合系统的应用越来越广泛,提出了2种降低译码复杂度的方式:简化的左信息更新方式和剪枝译码算法。简化的左信息更新方式对于N=256,N=1024的极化码分别能降低37.6%和44.6%的存储资源占用数;剪枝译码算法在码率为0.5时能降低50%左右的计算复杂度。基于简化的SCAN算法改进了联合检测译码算法,在接收机采用外循环迭代的结构,引入了阻尼机制,选取最优的阻尼方式和最优阻尼值。仿真分析了所提联合检测译码算法与原有联合检测译码算法的误码率性能差异,外迭代接收机性能与内外双循环迭代的接收机性能相同,采用阻尼机制联合接收机的性能比无阻尼接收机的性能高0.8 dB左右,SJIDD的误帧率性能比保留宽度为32的SCLJDD的性能低0.7 dB左右,但能使接收机处理时延降至原来的1/4~1/8。     

基于遗传萤火虫算法的含风电电力系统机组组合研究

随着风能资源的广泛应用,机组组合问题求解愈显复杂。以减少煤耗费用提高系统经济性为目标,提出一种采用遗传萤火虫算法求解含风电电力系统机组组合问题的新方法。引入遗传算法双矩阵通路判断及约束修复策略,提高了初始解生成质量及产生速度;再利用萤火虫算法求解连续负荷经济优化分配,给出自适应交叉概率,从而提高了算法的收敛速度。应用所提算法对经典10机系统优化仿真表明,与其他算法相比,该方法能合理安排机组组合,提高系统供电的经济性,具有较好的实用价值。     

Distributed privacy protection strategy for MEC enhanced wireless body area networks

With the rapid development and widespread application of Wireless Body Area Networks (WBANs), the traditional centralized system architecture cannot handle the massive data generated by the edge devices. Meanwhile, in order to ensure the security of physiological privacy data and the identity privacy of patients, this paper presents a privacy protection strategy for Mobile Edge Computing(MEC) enhanced WBANs, which leverages the blockchain-based decentralized MEC paradigm to support efficient transmission of privacy information with low latency, high reliability within a high-demand data security scenario. On this basis, the Merkle tree optimization model is designed to authenticate nodes and to verify the source of physiological data. Furthermore, a hybrid signature algorithm is devised to guarantee the node anonymity with unforgeability, data integrity and reduced delay. The security performance analysis and simulation results show that our proposed strategy not only reduces the delay, but also secures the privacy and transmission of sensitive WBANs data.     

一种快速解压的无损压缩算法

随着信息技术的不断发展,大量数据给存储和传输都带来了巨大的挑战。数据压缩能够有效减少数据量,方便数据的处理和传输。无损压缩是一种利用数据的冗余特点进行压缩的压缩方法,解压时可以完全还原数据而不会有任何失真。在研究LZO算法的快速解压原理基础上,设计了一种新的压缩算法。该算法通过减少压缩数据中压缩块的数量,降低了解压程序的执行开销。测试结果表明,新算法可实现比LZO算法更快的解压速度。     

基于凸闭包集的不规则三角网算法研究与实现

不规则三角网是影响土石方量计算的关键问题之一，虽然目前已有大量研究人员对Delaunay三角网进行优化，但仍然缺少对三角网生成速率和计算精度的综合研究。针对此问题，基于VB.NET平台的点、边以及三角形的结构化数据结构设计快速生成凸闭包集形成Delaunay三角网，通过四边形空圆特性以及对角线最短原则对构网结果进行检验和优化。试验计算表明，该算法的计算结果与经典DTM法、方格网法的土方量计算相对误差均在0.30%以内。该方法不仅具有较高的组网效率，并能保持较好的计算精度。